Data Structures for Interpolation of Illumination with Radiance and Irradiance Caching
نویسنده
چکیده
Irradiance and radiance caching are important algorithms for solving the light transport problem in realistic image synthesis. ey both require geometric search data structures for efficient rendering. Our goal was to improve the caching algorithms by improving these data structures. We have implemented 6 different data structures for irradiance caching, 2 previously used and 4 newly adapted to the problem. Our testing showed that multiple-reference data structures offer the best traversal performance at the cost of higher memory consumption. For interpolation on glossy surfaces we have implemented the spatial directional radiance caching. Instead of modifying its data structures we have created a novel radiance caching algorithm by merging its spatial and directional interpolation phases, creating the uni ed radiance cache.
منابع مشابه
Anisotropic Radiance-Cache Splatting for Efficiently Computing High-Quality Global Illumination with Lightcuts
Computing global illumination in complex scenes is even with todays computational power a demanding task. In this work we propose a novel irradiance caching scheme that combines the advantages of two state-of-the-art algorithms for high-quality global illumination rendering: lightcuts, an adaptive and hierarchical instant-radiosity based algorithm and the widely used (ir)radiance caching algori...
متن کاملPre-convolved Radiance Caching
The incident indirect light over a range of image pixels is often coherent. Two common approaches to exploit this inter-pixel coherence to improve rendering performance are Irradiance Caching and Radiance Caching. Both compute incident indirect light only for a small subset of pixels (the cache), and later interpolate between pixels. Irradiance Caching uses scalar values that can be interpolate...
متن کاملMulti-mesh Caching and Hardware Sampling for Progressive and Interactive Rendering
We present a framework for progressive and interactive rendering with soft shadows and indirect illumination of a triangulated scene. Our method is a multi-pass algorithm that separates the rendering of each main component of radiance in order to update the image as fast as new samples are computed. Those radiance samples are computed at the vertices of multiple recursively subdivided meshes, a...
متن کاملParallel Irradiance Caching on the Gpu
While ray tracing is highly parallelizable in concept, the Radiance suite of programs for architectural global illumination simulation was written for serial execution and makes use of certain heuristic techniques that are not easily performed in parallel environments. It uses irradiance caching to store and reuse the results of expensive indirect irradiation computations. The irradiance cache ...
متن کاملIrradiance Caching for Global Illumination Calculation on Graphics Hardware
Recent developments in integrated circuit technology tend toward increased numbers of cores rather than faster clock speeds, so software must use parallelism to achieve faster run times. The ray tracing performed by Radiance is highly parallelizable in concept, with the exception of irradiance caching that serially stores and retrieves results of expensive indirect irradiation computations. Thi...
متن کامل